Addressing robustness in time-critical, distributed, task allocation algorithms
نویسندگان
چکیده
منابع مشابه
Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملA Robust, Distributed Task Allocation Algorithm for Time-Critical, Multi Agent Systems Operating in Uncertain Environments
The aim of this work is to produce and test a robust, distributed, multi-agent task allocation algorithm, as these are scarce and not well-documented in the literature. The vehicle used to create the robust system is the Performance Impact algorithm (PI), as it has previously shown good performance. Three different variants of PI are designed to improve its robustness, each using Monte Carlo sa...
متن کاملDistributed Task Scheduling and Allocation Using Genetic Algorithms
As complexity and size of projects increase so do the problems associated with the scheduling and management of the design, manufacturing and assembly processes. In the context of large projects the ability to optimise the scheduling and allocation of these processes can also aid in tendering for contract as well as the management of the project itself. Many large projects will be constructed a...
متن کاملRobustness of Market-Based Task Allocation in a Distributed Satellite System
The perceived robustness of multi-agent systems is claimed to be one of the great benefits of distributed control, but centralised control dominates in space applications. We propose the use of marketbased control to allocate tasks in a distributed satellite system. The use of an artificial currency allows us to take the capabilities, energy levels and location of individual satellites, as well...
متن کاملDistributed, low contention task allocation
Designing a good task allocation algorithm faces the challenge of allowing high levels of throughput, so that tasks are executed fast and processor parallelism is exploited, while still guaranteeing a low level of memory contention, so that performance does not su er because of limitations on processor-to-memory bandwidth. In this work, we present a comparative study of throughput and contentio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Intelligence
سال: 2018
ISSN: 0924-669X,1573-7497
DOI: 10.1007/s10489-018-1169-3